Guaranteeing Timed Opacity using Parametric Timed Model Checking

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing occurs whenever an attacker successfully deduces confidential internal information. In this work, we consider that has access (only) to system execution time. We address following timed opacity problem: given a system, private location and final location, synthesize times from initial for which one cannot deduce whether went through location. also full problem, asking is opaque all times. show these problems are decidable automata (TAs) but become undecidable when adds parameters, yielding parametric (PTAs). identify subclass with some decidability results. then devise algorithm synthesizing PTAs parameter valuations guaranteeing resulting TA opaque. finally our method apply program analysis.